//Tuesday, October 27 2009
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class PaperAndPaintEasy
{
public:
	long long computeArea(int width, int height, int xfold, int cnt, int x1, int y1, int x2, int y2)
	{
		long long ret = 0;
		cnt++;
		int Min = min(width-xfold, xfold);
		int Max = max(width-xfold, xfold);
		if(x1 < Min)
		{
			ret += (long long)(min(x2, Min)-x1)*(y2-y1)*2*cnt;
			if(x2>=Min)
				ret += (long long) (x2-Min)*(y2-y1)*cnt;
		}
		else
			ret += (long long) (x2-x1)*(y2-y1)*cnt;
		return (long long)(width)*height-ret;
	}
};
